Asymptotically optimal Boolean functions
نویسنده
چکیده
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conjecture due to Patterson and Wiedemann from 1983.
منابع مشابه
Synthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates
We consider the realization of Boolean functions by combinatorial circuits with unreliable gates computing the functions from a full final basis B. We assume that all gates of the basis can have inverse faults on the outputs independently with probability ε (ε ∈ (0, 1/2)). We describe a set Mk (k ≥ 3) of Boolean functions, presence even by one of which in basis B guarantees the computing of alm...
متن کاملThe Reliability of Circuits in the Basis Anticonjunction with Constant Faults of Gates
We consider the realization of Boolean functions by asymptotically optimal reliable circuits with constant faults at the outputs of the gates in the basis {x|y} (where x|y п»„anticonjunction i.п»„. x|y = x&y). It is proved that almost all Boolean functions can be realized by asymptotically optimal reliable circuits that operate with unreliability asymptotically equal to 2ε0 + ε1 at ε0, ε1 → 0, ...
متن کاملBest-fit Interval Extensions of Partially Defined Boolean Functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their value is true, if and only if the input data viewed as an n-bit integer belongs to the interval [a, b] corresponding to the function concerned. In this paper we show, that the problem of finding an interval function, w...
متن کاملA relation between additive and multiplicative complexity of Boolean functions
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {⊕,∧, 1}. To start, consider a problem of computation of polynomials over a semiring (K,+,×) by circuits over the arithmetic basis {+,×} ∪K. It’s a common knowledge that a polynomial of n variables with nonsca...
متن کاملBounds for the Computational
It is shown that feedforward neural nets of constant depth with piecewise polynomial activation functions and arbitrary real weights can be simulated for boolean inputs and outputs by neural nets of a somewhat larger size and depth with heaviside gates and weights from f0; 1g. This provides the rst known upper bound for the computational power and VC-dimension of such neural nets. It is also sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.08215 شماره
صفحات -
تاریخ انتشار 2017